Extremely efficient and deterministic approach to generating optimal ordering of diffusion MRI measurements.
نویسندگان
چکیده
PURPOSE Diffusion MRI measurements are typically acquired sequentially with unit gradient directions that are distributed uniformly on the unit sphere. The ordering of the gradient directions has significant effect on the quality of dMRI-derived quantities. Even though several methods have been proposed to generate optimal orderings of gradient directions, these methods are not widely used in clinical studies because of the two major problems. The first problem is that the existing methods for generating highly uniform and antipodally symmetric gradient directions are inefficient. The second problem is that the existing methods for generating optimal orderings of gradient directions are also highly inefficient. In this work, the authors propose two extremely efficient and deterministic methods to solve these two problems. METHODS The method for generating nearly uniform point set on the unit sphere (with antipodal symmetry) is based upon the notion that the spacing between two consecutive points on the same latitude should be equal to the spacing between two consecutive latitudes. The method for generating optimal ordering of diffusion gradient directions is based on the idea that each subset of incremental sample size, which is derived from the prescribed and full set of gradient directions, must be as uniform as possible in terms of the modified electrostatic energy designed for antipodally symmetric point set. RESULTS The proposed method outperformed the state-of-the-art method in terms of computational efficiency by about six orders of magnitude. CONCLUSIONS Two extremely efficient and deterministic methods have been developed for solving the problem of optimal ordering of diffusion gradient directions. The proposed strategy is also applicable to optimal view-ordering in three-dimensional radial MRI.
منابع مشابه
Optimal ordering quantities for substitutable deteriorating items under joint replenishment with cost of substitution
In this paper we develop an inventory model, to determine the optimal ordering quantities, for a set of two substitutable deteriorating items. In this inventory model the inventory level of both items depleted due to demands and deterioration and when an item is out of stock, its demands are partially fulfilled by the other item and all unsatisfied demand is lost. Each substituted item incurs a...
متن کاملPseudometrically constrained centroidal voronoi tessellations: Generating uniform antipodally symmetric points on the unit sphere with a novel acceleration strategy and its applications to diffusion and three-dimensional radial MRI.
PURPOSE The purpose of this work is to investigate the hypothesis that uniform sampling measurements that are endowed with antipodal symmetry play an important role in image quality when the raw data and image data are related through the Fourier relationship. Currently, it is extremely challenging to generate large and uniform antipodally symmetric point sets suitable for three-dimensional rad...
متن کاملDynamic Contrast Magnetic Resonance Imaging (DCE-MRI) and Diffusion Weighted MR Imaging (DWI) for Differentiation between Benign and Malignant Salivary Gland Tumors
Background: Salivary gland tumors form nearly 3% of head and neck tumors. Due to their large histological variety and vicinity to facial nerves, pre-operative diagnosis and differentiation of benign and malignant parotid tumors are a major challenge for radiologists. Objective: The majority of these tumors are benign; however, sometimes they tend to transform into a malignant form. Functional M...
متن کاملAn L1-norm method for generating all of efficient solutions of multi-objective integer linear programming problem
This paper extends the proposed method by Jahanshahloo et al. (2004) (a method for generating all the efficient solutions of a 0–1 multi-objective linear programming problem, Asia-Pacific Journal of Operational Research). This paper considers the recession direction for a multi-objective integer linear programming (MOILP) problem and presents necessary and sufficient conditions to have unbounde...
متن کاملA POLYNOMIAL TIME BRANCH AND BOUND ALGORITHM FOR THE SINGLE ITEM ECONOMIC LOT SIZING PROBLEM WITH ALL UNITS DISCOUNT AND RESALE
The purpose of this paper is to present a polynomial time algorithm which determines the lot sizes for purchase component in Material Requirement Planning (MRP) environments with deterministic time-phased demand with zero lead time. In this model, backlog is not permitted, the unit purchasing price is based on the all-units discount system and resale of the excess units is possible at the order...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Medical physics
دوره 38 8 شماره
صفحات -
تاریخ انتشار 2011